The core model for almost linear iterations
نویسندگان
چکیده
منابع مشابه
The core model for almost linear iterations
We introduce 0 | • (“zero hand-grenade”) as a sharp for an inner model with a proper class of strong cardinals. We prove the existence of the core model K in the theory “ZFC + 0 | • doesn’t exist.” Combined with work of Woodin, Steel, and earlier work of the author, this provides the last step for determining the exact consistency strength of the assumption in the statement of the 12th Delfino ...
متن کاملThe core model for almost linear iterations ( Preliminary version ) Ralf
We introduce 0 | • (“zero hand-grenade”) as a sharp for an inner model with a proper class of strong cardinals. We prove the existence of the core model K in the theory “ZFC + 0 | • doesn’t exist,” and apply this to obtain an equiconsistency result.
متن کاملthe use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولFast linear iterations for distributed averaging
We consider the problem of !nding a linear iteration that yields distributed averaging consensus over a network, i.e., that asymptotically computes the average of some initial values given at the nodes. When the iteration is assumed symmetric, the problem of !nding the fastest converging linear iteration can be cast as a semide!nite program, and therefore e"ciently and globally solved. These op...
متن کاملFaster Linear Iterations for Distributed Averaging
Abstract: Distributed averaging problems are a subclass of distributed consensus problems, which have received substantial attention from several research communities. Although many of the proposed algorithms are linear iterations, they vary both in structure and state dimension. In this paper, we investigate the performance benefits of adding extra states to distributed averaging iterations. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2002
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(01)00113-0